A Two-Dimensional Pictorial Presentation of Berele's Insertion Algorithm for Symplectic Tableaux

نویسندگان

  • Tom Roby
  • Itaru Terada
چکیده

We give the first two-dimensional pictorial presentation of Berele’s correspondence [B], an analogue of the Robinson-Schensted (R-S) correspondence [Ri, Se] for the symplectic group Sp(2n,C). From the standpoint of representation theory, the R-S correspondence combinatorially describes the irreducible decomposition of the tensor powers of the natural representation of GL(n,C). Berele’s insertion algorithm gives the bijection that describes the irreducible decomposition of the tensor powers of the natural representation of Sp(2n,C). Two-dimensional pictorial presentations of the R-S correspondence via local rules (first given by S. Fomin [F1, F2]) and its many variants have proven very useful in understanding their properties and creating new generalizations. We hope our new presentation will be similarly useful.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Differential Algebraic Integration Algorithm for Symplectic Mappings in Systems with Three-Dimensional Magnetic Field

A differential algebraic integration algorithm is developed for symplectic mapping through a three-dimensional (3-D) magnetic field. The self-consistent reference orbit in phase space is obtained by making a canonical transformation to eliminate the linear part of the Hamiltonian. Transfer maps from the entrance to the exit of any 3D magnetic field are then obtained through slice-by-slice sympl...

متن کامل

Finite convergent presentation of plactic monoid for type C

We give an explicit presentation for the plactic monoid for type C using admissible column generators. Thanks to the combinatorial properties of symplectic tableaux, we prove that this presentation is finite and convergent. We obtain as a corollary that plactic monoids for type C satisfy homological finiteness properties.

متن کامل

Dyck tableaux

The starting point of this work is the discovery of a new and direct construction that relies bijectively the permutations of length n to some weighted Dyck paths named subdivided Laguerre histories. These objects correspond to the combinatorial interpretation of the development of the generating function for factorial numbers in terms of a Stieltjes continued fraction [9]. Such a bijection has...

متن کامل

Hook-content Formulae for Symplectic and Orthogonal Tableaux

By considering the specialisation sλ(1, q, q , . . . , q) of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape λ in terms of two properties of the boxes in the diagram for λ. Using specialisations of symplectic and orthogonal Schur functions, we derive corresponding formulae, first given by El Samra and King, for the number of semi...

متن کامل

Bumping algorithm for set-valued shifted tableaux

We present an insertion algorithm of Robinson–Schensted type that applies to set-valued shifted Young tableaux. Our algorithm is a generalization of both set-valued non-shifted tableaux by Buch and non set-valued shifted tableaux by Worley and Sagan. As an application, we obtain a Pieri rule for a K-theoretic analogue of the Schur Q-functions. Résumé Nous présentons un algorithme d’insertion de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2005